Some Gabidulin Codes Cannot Be List Decoded Efficiently at any Radius
نویسندگان
چکیده
منابع مشابه
Bounds on List Decoding Gabidulin Codes
An open question about Gabidulin codes is whether polynomial-time list decoding beyond half the minimum distance is possible or not. In this contribution, we give a lower and an upper bound on the list size, i.e., the number of codewords in a ball around the received word. The lower bound shows that if the radius of this ball is greater than the Johnson radius, this list size can be exponential...
متن کاملIterative list-decoding of Gabidulin codes via Gröbner based interpolation
We show how Gabidulin codes can be list decoded by using an iterative parametrization approach. For a given received word, our decoding algorithm processes its entries one by one, constructing four polynomials at each step. This then yields a parametrization of interpolating solutions for the data so far. From the final result a list of all codewords that are closest to the received word with r...
متن کاملGeneralized Gabidulin codes over fields of any characteristic
We generalist Gabidulin codes to the case of infinite fields, eventually with characteristic zero. For this purpose, we consider an abstract field extension and any automorphism in the Galois group. We derive some conditions on the automorphism to be able to have a proper notion of rank metric which is in coherence with linearized polynomials. Under these conditions, we generalize Gabidulin cod...
متن کاملList Decoding of Lifted Gabidulin Codes via the Plücker Embedding
Codes in the Grassmannian have recently found an application in random network coding. All the codewords in such codes are subspaces of Fq with a given dimension. In this paper, we consider the problem of list decoding of a certain family of codes in the Grassmannian, called lifted Gabidulin codes. For this purpose we use the Plücker embedding of the Grassmannian. We describe a way of represent...
متن کاملUnreconstructible at Any Radius
Modeling pattern data series with cellular automata fails for a wide range of deterministic nonlinear spatial processes. If the latter have finite spatially-local memory, reconstructed cellular automata with infinite radius may be required. In some cases, even this is not adequate: an irreducible stochasticity remains on the shortest time scales. The underlying problem is illustrated and quanti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2016
ISSN: 0018-9448,1557-9654
DOI: 10.1109/tit.2016.2532343